Follow the day's latest updates Court approves $23.5m fine and costs order against ASX Shadow arts minister says AI companies need to do what everyone else does: 'ask permission and pay for it' Albanese defends gambling reforms, says he's'not against someone having a punt' Pocock says it's'tragic' gambling reforms don't go nearly far enough Shadow arts minister says AI companies need to do what everyone else does: 'ask permission and pay for it' If AI companies want to use Australian creative work, they should do what everyone else does: ask permission and pay for it. Australian creativity is one of our greatest national assets - not a free resource for multinational tech companies. The Coalition will always back the right of artists to control their work and be fairly compensated when others profit from it. This is about consent, fairness and respect for Australian creativity. Court approves $23.5m fine and costs order against ASX Shadow arts minister says AI companies need to do what everyone else does: 'ask permission and pay for it' Albanese defends gambling reforms, says he's'not against someone having a punt' Pocock says it's'tragic' gambling reforms don't go nearly far enough Court approves $23.5m fine and costs order against ASX A federal court judge has ordered the ASX operator to pay $23.5m in penalties and costs after the company admitted to making a misleading statement about a troubled upgrade for technology required to run the stock exchange.

Self-evolution offers a scalable path to stronger reasoning: a pretrained language model improves itself with only minimal external supervision. Yet existing methods either depend on extensively curated or teacher-generated training data, or, when the generator runs unsupervised, reward it by a difficulty heuristic that need not improve the solver. We introduce INFUSER, an iterative co-training framework with two co-evolving roles: a Generator that drafts questions and reference golden answers from a pool of unstructured, automatically collected documents, and a Solver that improves by training on them. The solver is trained with standard correctness rewards against the generator-provided answers, while the generator is rewarded by an optimizer-aware influence score that measures whether each proposed question would actually improve the solver on the target distribution. Because this continuous, noisy influence score is poorly served by standard GRPO, we propose DuGRPO, a dual-normalized variant of GRPO, for generator training. Together, these turn the document pool into an adaptive curriculum that favors questions useful to the current solver, not just hard ones. On Qwen3-8B-Base, INFUSER outperforms strong self-evolution baselines with over 20% relative improvement on Olympiad and SuperGPQA benchmarks, and an 8B INFUSER co-evolving generator outperforms a frozen 32B thinking generator on math and coding. Ablations confirm each design choice is necessary, and two extensions, applying INFUSER to an instruction-finetuned anchor and augmenting it with rule-verifiable RLVR data, further demonstrate the flexibility and generalizability of the framework. Code is available at https://github.com/FFishy-git/INFUSER.

We generalize the universal approximation theorem for functional input neural networks (FNN) to differentiable maps by including the approximation of the derivatives. A FNN maps the input from a possibly infinite-dimensional weighted manifold to the real-valued hidden layer, on which a non-linear scalar activation function is applied, and then returns the output into a Banach space via some linear readouts. By proving a weighted Nachbin theorem, we establish a universal approximation theorem for differentiable maps, which goes beyond the usual formulation on compact sets and also includes the approximation of the derivatives. This leads us to approximation results for non-anticipative functionals including the horizontal and vertical derivatives. As a further application, we show that linear functions of the signature are able to approximate path space functionals including their directional derivatives.

Flexion Robotics, a startup founded by ex-Nvidia engineers, has a clever way of training robots to do useful work. Humanoid robots might be able to run, dance, and occasionally kick people, but to become human, they're going to need to learn how to do all sorts of menial chores at work. Flexion Robotics, a Swiss startup founded by ex-Nvidia robotics researchers, thinks it has the solution. The company has developed a way to train robots to perform complex tasks that involve simple skills like opening doors, climbing stairs, and carrying boxes. The key is to teach the robots individual skills in simulation, then have a master AI algorithm determine how to use them.

Binary classification from positive-only samples is a variant of PAC learning in which the learner receives i.i.d. samples from the positive region of an unknown target concept, but is evaluated under the original distribution (which places mass on both positive and negative regions). This model dates back to Natarajan [1987, STOC], and the characterization of improper learning is well-known -- it even appears in textbooks. The characterization of proper positive-only learning, however, has long remained open. In this work, we revisit and settle this question: a concept class is properly learnable from positive-only samples if and only if it has finite VC dimension and satisfies a new combinatorial condition, which we call uniform exterior separability. Together with several separation results, this characterization reveals a surprisingly rich landscape that differs sharply from standard PAC learning: proper and improper learning are separated, randomized and deterministic proper learning are separated, there are classes for which no ERM is a learner, and finite VC dimension does not suffice even for non-uniform learning. Along the way, we introduce new combinatorial dimensions that we believe can be of broader interest in learning theory.

Nick Cave and Kylie Minogue are among Australian artists reportedly found in datasets used to train artificial intelligence. Nick Cave and Kylie Minogue are among Australian artists reportedly found in datasets used to train artificial intelligence. 'It's all just rendered useless', Something For Kate's Paul Dempsey says as AI scrapes millions of songs to learn how to make music Paul Dempsey and Bernard Fanning are among big-name Australian musicians upset that their original songs have been found in datasets used to train artificial intelligence. A dataset search tool recently created by US publication The Atlantic reveals millions of creative works have been scraped from the internet to train the disruptive technology. It includes a vast catalogue of work by Australian artists, with tunes by Kylie Minogue, Powderfinger, Nick Cave and Jimmy Barnes, and novels by Thomas Keneally and Peter Carey.

We study the fundamental problem of learning a high-dimensional Gaussian truncated to an unknown halfspace. Lee, Mehrotra and Zampetakis (FOCS'24) recently obtained the first polynomial time algorithm for this problem, but their resulting sample and time complexity bounds are not optimal. Under non-trivial truncation, for any target accuracy $\varepsilon > 0$ and dimension $d$ we give an efficient algorithm that uses $n = \tilde{O}(d^2/\varepsilon^2)$ samples and learns the underlying Gaussian to error $\varepsilon$ in total variation distance. Our algorithm is also fast: its runtime is dominated by the cost of computing the empirical covariance matrix. Both our sample and time complexity are optimal in terms of $d$ and $\varepsilon$ even without truncation: in this regard, we can learn a Gaussian under halfspace truncation for free. The key ingredient behind our result is a novel reinterpretation of the low-degree moments of the truncated Gaussian in terms of a relative truncation parameter. This relative truncation parameter uniquely determines the parameters of the untruncated Gaussian and enables direct parameter recovery. This reinterpretation allows us to circumvent the time intensive projected stochastic gradient descent procedure that is widely used in learning under truncation.

Things to Do in L.A. Tap to enable a layout that focuses on the article. Fifth grade students work on computers at their South Los Angeles school in 2019. This is read by an automated voice. Please report any issues or inconsistencies here . Los Angeles Unified will ban classroom screen time in preschool through first grade and sharply limit it for older students.

Unsupervised Environment Design (UED) seeks to automatically generate training curricula for reinforcement learning (RL) agents, with the goal of improving generalisation and zero-shot performance. However, designing effective curricula remains a difficult problem, particularly in settings where small subsets of environment parameterisations result in significant increases in the complexity of the required policy. Current methods struggle with a difficult credit assignment problem and rely on regret approximations that fail to identify challenging levels, both of which are compounded as the size of the environment grows. We propose Dynamic Environment Generation for UED (DEGen) to enable a denser level generator reward signal, reducing the difficulty of credit assignment and allowing for UED to scale to larger environment sizes. We also introduce a new regret approximation, Maximised Negative Advantage (MNA), as a significantly improved metric to optimise for, that better identifies more challenging levels. We show empirically that MNA outperforms current regret approximations and when combined with DEGen, consistently outperforms existing methods, especially as the size of the environment grows. We have made all our code available here: https://github.

President Trump probably can't get rid of her yet, but FCC commissioner Anna Gomez still checks her email every day to see if he has. Until then, she wants to stand up for the First Amendment. If you've given much thought to the Federal Communications Commission in recent years, it probably had something to do with Brendan Carr . The group's chairman since 2025, Carr has been on an ongoing, public rampage against freedom of speech: he's gone after late-night hosts like Jimmy Kimmel, threatened to revoke broadcast licenses over Iran war coverage, and targeted networks for their DEI policies. Disturbing as Carr's rhetoric and actions have been, he does count at least one opponent within the agency: Commissioner Anna Gomez, currently the lone Democrat among three FCC commissioners, has been vocal about the damage she thinks the agency is doing to American press freedom--and has repeatedly urged the public and the press, namely major networks like ABC, CBS, and NBC, to fight back. In May, Commissioner Gomez penned a stunning public letter to Disney CEO Josh D'Amaro, wherein she warned that the company--which owns ABC--was being subjected to "a sustained, coordinated campaign of censorship and control, carried out through the weaponization of the FCC's authority as a federal regulator and aimed at pressuring a free and independent press." Gomez urged D'Amaro to fight the actions her own agency was taking, adding that "this is a fight worth having, and one that I am confident you will win." I wanted to talk to Commissioner Gomez about that bold letter, the risks she sees for the media and the American public under the Trump administration, and how she works alongside a chairman with whom she disagrees so fiercely. Gomez, whose FCC term ends this month, was generous enough to sit down and talk about all of it. You can read our conversation below, or listen to it on the podcast platform of your choice. KATIE DRUMMOND: Welcome, Commissioner Gomez. Thank you for being here. It's great to be here. I want to start, before we talk more about Disney and your letter and all the rest of it, with a very basic question for our listeners. What is your agency's basic role?